RNACompress: Grammar-based compression and informational complexity measurement of RNA secondary structure
نویسندگان
چکیده
منابع مشابه
Subclasses of Tree Adjoining Grammar for RNA Secondary Structure
Several grammars have been proposed for representing RNA secondary structure including pseudoknots. In this paper, we introduce subclasses of multiple context-free grammars which are weakly equivalent to these grammars for RNA, and clarify the generative power of these grammars as well as closure property.
متن کاملOn the Complexity of Grammar-Based Compression over Fixed Alphabets
It is shown that the shortest-grammar problem remains NP-complete if the alphabet is fixed and has a size of at least 24 (which settles an open question). On the other hand, this problem can be solved in polynomial-time, if the number of nonterminals is bounded, which is shown by encoding the problem as a problem on graphs with interval structure. Furthermore, we present an O(3) exact exponenti...
متن کاملCharacterization of Enzyme Structure by Informational Complexity
It is well-known that enzymes is very important as reaction factor in life systems activity. But the properties based on information theory are not yet enough in biological studies. Then, we examined correlation the complexity at amino acid sequences with its function of Enzymes by informational measure, in order to elucidate the informational properties of sequence structure. Also, power spect...
متن کاملGrammar-Based Graph Compression
We present a new graph compressor that works by recursively detecting repeated substructures and representing them through grammar rules. We show that for a large number of graphs the compressor obtains smaller representations than other approaches. Specific queries such as reachability between two nodes or regular path queries can be evaluated in linear time (or quadratic times, respectively),...
متن کاملGrammar - Based Compression By
P rograms that must run at or near top speed must use native machine code, but some programs have more modest performance requirements. For example, a cellular telephone handset might include software that reacts to key-strokes and spends most of its time waiting for the next input. An interpreted code can run quickly enough for such applications and can be smaller than machine code. Witness th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2008
ISSN: 1471-2105
DOI: 10.1186/1471-2105-9-176